Browsing by Subject "Routing algorithms"

Now showing items 1-6 of 6

    • Article  

      Direct routing: Algorithms and complexity 

      Busch, Costas; Magdon-Ismail, M.; Mavronicolas, Marios; Spirakis, Paul G. (2004)
      Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three ...
    • Article  

      Efficient bufferless packet switching on trees and leveled networks 

      Busch, Costas; Magdon-Ismail, M.; Mavronicolas, Marios (2007)
      In bufferless networks the packets cannot be buffered while they are in transit
    • Conference Object  

      An efficient handover algorithm for MBMS enabled 3G mobile cellular networks 

      Christophorou, C.; Pitsillides, Andreas (2006)
      With the introduction of Multimedia Broadcast Multicast Service (MBMS) in 3rd Generation (3G) Networks, the Radio Network Controller (RNC) for radio efficiency reasons can use either Dedicated or Common resources to ...
    • Conference Object  

      Genetic algorithms for shortest path routing of autonomous gliders 

      Kahveci, N. E.; Ioannou, Petros A. (2008)
      Onboard power resources pose inevitable limitations on the flight performance of any aerial vehicle regardless of its type, size or mission. Popular soaring techniques recognized to be providing significant energy savings ...
    • Article  

      A hybrid fault-tolerant algorithm for MPLS networks 

      Hadjiona, Maria; Georgiou, Chryssis; Papa, Maria; Vassiliou, Vasos (2008)
      In this paper we present a new fault tolerant, path maintaining, algorithm for use in MPLS based networks. The novelty of the algorithm lies upon the fact that it is the first to employ both path restoration mechanisms ...
    • Conference Object  

      Universal bufferless routing 

      Busch, Costas; Magdon-Ismail, M.; Mavronicolas, Marios (2005)
      Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time ...